Algorithms for Quantum Branching Programs Based on Fingerprinting
نویسندگان
چکیده
منابع مشابه
Algorithms for Quantum Branching Programs Based on Fingerprinting
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of Boolean functions by their characteristic polynomials. We use circuit notation for branching programs for desired algorithms presentation. For several known func...
متن کاملOn the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting
We develop quantum fingerprinting technique for constructing quantum branching programs (QBPs), which are considered as circuits with an ability to use classical bits as control variables. We demonstrate our approach constructing optimal quantum ordered binary decision diagram (QOBDD) for MODm Boolean function. The construction of our technique also allows to extend the recent result of Ambaini...
متن کاملOn Computational Power of Quantum Branching Programs
In this paper we study a model of Quantum Branching Program (QBP) and investigate its computational power. We define several natural restrictions of a general QBP model, such as a read-once and a read-k-times QBP, noting that obliviousness is inherent in a quantum nature of such programs. In particular we show that any Boolean function can be computed deterministically (exactly) by a read-once ...
متن کاملClassical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function with error δ we present a classical deterministic branching program of the same length and width at most (1 + 2/(1− 2δ)) that computes the same function. Second technique is a classical stochastic simulation technique f...
متن کاملClassical vs. Quantum Read-Once Branching Programs
A simple, explicit boolean function on 2n input bits is presented that is computable by errorfree quantum read-once branching programs of size O(n), while each classical randomized read-once branching program and each quantum OBDD for this function with bounded twosided error requires size 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2009
ISSN: 2075-2180
DOI: 10.4204/eptcs.9.1